Preservation of Properness under Countable Support Iteration

نویسنده

  • VERA FISCHER
چکیده

If ≤ is a preorder on a set P and p0 ≤ p1, we say that p1 is an extension of p0. Recall that a preorder is separative if and only if whenever p1 is not an extension of p0 there is an extension of p1 which is incompatible with p0. We say that P = (P,≤) is a forcing notion (also forcing poset) if ≤ is a separative preorder with minimal element 0P. Note that if P is separative and p1 p̌0 ∈ Ġ then p0 ≤ p1 (here Ġ is the canonical name of the P-generic set). Also often in forcing formulas we write a instead of ǎ for an element a of the ground model V .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Properness without Elementaricity

We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary sub-models of some (H(χ),∈). This leads to forcing notions which are “reasonably” definable. We present two specific properties materializing this intuition: nep (non-elementary properness) and snep (Souslin non-elementary properness) and al...

متن کامل

n-localization property in iterations∗

The n-localization property is preserved under the countable support iteration of suitably definable forcings. This solves a question of Ros lanowski and greatly simplifies the proofs in the area.

متن کامل

Many countable support iterations of proper forcings preserve Souslin trees

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support iterations in the so-called Case A that does not need a division into forcings that add reals and those who do not.

متن کامل

Preservation theorems for countable support forcing iterations

A major theme of [12] is preservation theorems for iterated forcing. These are theorems of the form “if 〈Pξ : ξ ≤ κ〉 is a countable support forcing iteration based on 〈Q̇ξ : ξ < κ〉 and each Q̇ξ has property such-and-such then Pκ has property thus-and-so.” The archetypal preservation theorem is the Fundamental Theorem of Proper Forcing [12, chapter III], which states that if each Q̇ξ is proper in V...

متن کامل

New reals: Can live with them, can live without them

Judah and Shelah [3] proved that countable support iterations of proper forcings preserve the ω-bounding property (see 2.2 here). In his book Proper and Improper Forcing [8, XVIII §3] Shelah gave several cases of general preservation theorems for proper countable support iterations (the proofs tend to be hard to digest, though). In this paper we deal with “Case A”. A simplified version of this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005